0.11/0.12	% Problem    : Vampire---4.8_9949 : TPTP v0.0.0. Released v0.0.0.
0.11/0.13	% Command    : run_E %s %d THM
0.12/0.34	% Computer : n012.cluster.edu
0.12/0.34	% Model    : x86_64 x86_64
0.12/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory   : 8042.1875MB
0.12/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1440
0.12/0.34	% WCLimit    : 180
0.12/0.34	% DateTime   : Mon Jul  3 12:44:07 EDT 2023
0.12/0.34	% CPUTime    : 
0.19/0.46	Running higher-order theorem provingRunning: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.JG203djvVT/Vampire---4.8_9949
0.19/0.46	# Version: 3.1pre001-ho
2.07/0.75	# Preprocessing class: HSSSSMSSSSSNSSA.
2.07/0.75	# Scheduled 8 strats onto 8 cores with 180 seconds (1440 total)
2.07/0.75	# Starting post_as_ho12 with 180s (1) cores
2.07/0.75	# Starting new_bool_9 with 180s (1) cores
2.07/0.75	# Starting post_as_ho1 with 180s (1) cores
2.07/0.75	# Starting post_as_ho4 with 180s (1) cores
2.07/0.75	# Starting post_as_ho2 with 180s (1) cores
2.07/0.75	# Starting ehoh_best2_full_lfho with 180s (1) cores
2.07/0.75	# Starting full_lambda_10 with 180s (1) cores
2.07/0.75	# Starting new_ho_8 with 180s (1) cores
2.07/0.75	# ehoh_best2_full_lfho with pid 10243 completed with status 0
2.07/0.75	# Result found by ehoh_best2_full_lfho
2.07/0.75	# Preprocessing class: HSSSSMSSSSSNSSA.
2.07/0.75	# Scheduled 8 strats onto 8 cores with 180 seconds (1440 total)
2.07/0.75	# Starting post_as_ho12 with 180s (1) cores
2.07/0.75	# Starting new_bool_9 with 180s (1) cores
2.07/0.75	# Starting post_as_ho1 with 180s (1) cores
2.07/0.75	# Starting post_as_ho4 with 180s (1) cores
2.07/0.75	# Starting post_as_ho2 with 180s (1) cores
2.07/0.75	# Starting ehoh_best2_full_lfho with 180s (1) cores
2.07/0.75	# No SInE strategy applied
2.07/0.75	# Search class: HGUNF-FFMF22-SSSFFMBN
2.07/0.75	# Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
2.07/0.75	# Starting ehoh_best2_full_lfho with 109s (1) cores
2.07/0.75	# ehoh_best2_full_lfho with pid 10247 completed with status 0
2.07/0.75	# Result found by ehoh_best2_full_lfho
2.07/0.75	# Preprocessing class: HSSSSMSSSSSNSSA.
2.07/0.75	# Scheduled 8 strats onto 8 cores with 180 seconds (1440 total)
2.07/0.75	# Starting post_as_ho12 with 180s (1) cores
2.07/0.75	# Starting new_bool_9 with 180s (1) cores
2.07/0.75	# Starting post_as_ho1 with 180s (1) cores
2.07/0.75	# Starting post_as_ho4 with 180s (1) cores
2.07/0.75	# Starting post_as_ho2 with 180s (1) cores
2.07/0.75	# Starting ehoh_best2_full_lfho with 180s (1) cores
2.07/0.75	# No SInE strategy applied
2.07/0.75	# Search class: HGUNF-FFMF22-SSSFFMBN
2.07/0.75	# Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
2.07/0.75	# Starting ehoh_best2_full_lfho with 109s (1) cores
2.07/0.75	# Preprocessing time       : 0.001 s
2.07/0.75	
2.07/0.75	# Proof found!
2.07/0.75	# SZS status Theorem
2.07/0.75	# SZS output start CNFRefutation
2.07/0.75	thf(decl_22, type, esk1_0: $i).
2.07/0.75	thf(decl_23, type, esk2_0: $i).
2.07/0.75	thf(decl_24, type, esk3_0: $i).
2.07/0.75	thf(decl_25, type, epred1_0: $i > $o).
2.07/0.75	thf(decl_26, type, esk4_2: ($i > $o) > ($i > $o) > $i).
2.07/0.75	thf(cTHM125C, conjecture, ![X1:$i, X2:$i, X3:$i, X4:$i > $o]:(?[X5:$i > $o, X6:$i > $o]:((((((X6 @ X1)|(X5 @ X1))&((X4 @ X2)|(X6 @ X2)))&![X7:$i]:(((X6 @ X7)<=>~((X4 @ X7)))))&((X5 @ X3)|~((X4 @ X3)))))), file('/export/starexec/sandbox2/tmp/tmp.JG203djvVT/Vampire---4.8_9949', cTHM125C)).
2.07/0.75	thf(c_0_1, negated_conjecture, ~(![X1:$i, X2:$i, X3:$i, X4:$i > $o]:(?[X5:$i > $o, X6:$i > $o]:((((((X6 @ X1)|(X5 @ X1))&((X4 @ X2)|(X6 @ X2)))&![X7:$i]:(((X6 @ X7)<=>~(X4 @ X7))))&((X5 @ X3)|~(X4 @ X3)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM125C])])).
2.07/0.75	thf(c_0_2, negated_conjecture, ![X19:$i > $o, X20:$i > $o]:((((((~(X19 @ esk3_0)|(~(X20 @ (esk4_2 @ X19 @ X20))|(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(epred1_0 @ esk2_0)|~(X20 @ esk1_0))))&((epred1_0 @ esk3_0)|(~(X20 @ (esk4_2 @ X19 @ X20))|(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(epred1_0 @ esk2_0)|~(X20 @ esk1_0)))))&((~(X19 @ esk3_0)|((X20 @ (esk4_2 @ X19 @ X20))|~(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(epred1_0 @ esk2_0)|~(X20 @ esk1_0))))&((epred1_0 @ esk3_0)|((X20 @ (esk4_2 @ X19 @ X20))|~(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(epred1_0 @ esk2_0)|~(X20 @ esk1_0))))))&(((~(X19 @ esk3_0)|(~(X20 @ (esk4_2 @ X19 @ X20))|(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(X20 @ esk2_0)|~(X20 @ esk1_0))))&((epred1_0 @ esk3_0)|(~(X20 @ (esk4_2 @ X19 @ X20))|(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(X20 @ esk2_0)|~(X20 @ esk1_0)))))&((~(X19 @ esk3_0)|((X20 @ (esk4_2 @ X19 @ X20))|~(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(X20 @ esk2_0)|~(X20 @ esk1_0))))&((epred1_0 @ esk3_0)|((X20 @ (esk4_2 @ X19 @ X20))|~(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(X20 @ esk2_0)|~(X20 @ esk1_0)))))))&((((~(X19 @ esk3_0)|(~(X20 @ (esk4_2 @ X19 @ X20))|(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(epred1_0 @ esk2_0)|~(X19 @ esk1_0))))&((epred1_0 @ esk3_0)|(~(X20 @ (esk4_2 @ X19 @ X20))|(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(epred1_0 @ esk2_0)|~(X19 @ esk1_0)))))&((~(X19 @ esk3_0)|((X20 @ (esk4_2 @ X19 @ X20))|~(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(epred1_0 @ esk2_0)|~(X19 @ esk1_0))))&((epred1_0 @ esk3_0)|((X20 @ (esk4_2 @ X19 @ X20))|~(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(epred1_0 @ esk2_0)|~(X19 @ esk1_0))))))&(((~(X19 @ esk3_0)|(~(X20 @ (esk4_2 @ X19 @ X20))|(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(X20 @ esk2_0)|~(X19 @ esk1_0))))&((epred1_0 @ esk3_0)|(~(X20 @ (esk4_2 @ X19 @ X20))|(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(X20 @ esk2_0)|~(X19 @ esk1_0)))))&((~(X19 @ esk3_0)|((X20 @ (esk4_2 @ X19 @ X20))|~(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(X20 @ esk2_0)|~(X19 @ esk1_0))))&((epred1_0 @ esk3_0)|((X20 @ (esk4_2 @ X19 @ X20))|~(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(X20 @ esk2_0)|~(X19 @ esk1_0))))))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])).
2.07/0.75	thf(c_0_3, negated_conjecture, ![X5:$i > $o, X4:$i > $o]:(((X5 @ (esk4_2 @ X4 @ X5))|~((X4 @ esk3_0))|~((epred1_0 @ (esk4_2 @ X4 @ X5)))|~((X5 @ esk2_0))|~((X4 @ esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
2.07/0.75	thf(c_0_4, negated_conjecture, ![X5:$i > $o, X4:$i > $o]:(((epred1_0 @ (esk4_2 @ X4 @ X5))|~((X4 @ esk3_0))|~((X5 @ (esk4_2 @ X4 @ X5)))|~((X5 @ esk2_0))|~((X4 @ esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
2.07/0.75	thf(c_0_5, negated_conjecture, ![X28:$i > $i, X27:$i > $i, X4:$i > $o]:(((X4 @ (esk4_2 @ (^[Z0/* 3 */:$i]:(((X27 @ Z0)=(X28 @ Z0)))) @ X4))|((X27 @ esk1_0)!=(X28 @ esk1_0))|((X27 @ esk3_0)!=(X28 @ esk3_0))|~((epred1_0 @ (esk4_2 @ (^[Z0/* 3 */:$i]:(((X27 @ Z0)=(X28 @ Z0)))) @ X4)))|~((X4 @ esk2_0)))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_3])).
2.07/0.75	thf(c_0_6, negated_conjecture, ![X5:$i > $o, X4:$i > $o]:(((epred1_0 @ (esk4_2 @ X4 @ (^[Z0/* 7 */:$i]:(~((X5 @ Z0))))))|(X5 @ (esk4_2 @ X4 @ (^[Z0/* 7 */:$i]:(~((X5 @ Z0))))))|(X5 @ esk2_0)|~((X4 @ esk1_0))|~((X4 @ esk3_0)))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_4])).
2.07/0.75	thf(c_0_7, negated_conjecture, ![X5:$i > $o, X4:$i > $o]:(((X5 @ (esk4_2 @ X4 @ X5))|~((X4 @ esk3_0))|~((epred1_0 @ (esk4_2 @ X4 @ X5)))|~((epred1_0 @ esk2_0))|~((X4 @ esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
2.07/0.75	thf(c_0_8, negated_conjecture, ![X4:$i > $o]:(((X4 @ (esk4_2 @ (^[Z0/* 3 */:$i]:(($true))) @ X4))|~((epred1_0 @ (esk4_2 @ (^[Z0/* 3 */:$i]:(($true))) @ X4)))|~((X4 @ esk2_0)))), inference(cn,[status(thm)],[inference(er,[status(thm)],[c_0_5])])).
2.07/0.75	thf(c_0_9, negated_conjecture, ![X4:$i > $o]:(((epred1_0 @ (esk4_2 @ X4 @ (^[Z0/* 7 */:$i]:(~((epred1_0 @ Z0))))))|(epred1_0 @ esk2_0)|~((X4 @ esk1_0))|~((X4 @ esk3_0)))), inference(ef,[status(thm)],[c_0_6])).
2.07/0.75	thf(c_0_10, negated_conjecture, ![X5:$i > $o, X4:$i > $o]:(((epred1_0 @ (esk4_2 @ X4 @ X5))|~((X4 @ esk3_0))|~((X5 @ (esk4_2 @ X4 @ X5)))|~((epred1_0 @ esk2_0))|~((X4 @ esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
2.07/0.75	thf(c_0_11, negated_conjecture, ![X28:$i > $i, X27:$i > $i, X4:$i > $o]:(((X4 @ (esk4_2 @ (^[Z0/* 3 */:$i]:(((X27 @ Z0)=(X28 @ Z0)))) @ X4))|((X27 @ esk1_0)!=(X28 @ esk1_0))|((X27 @ esk3_0)!=(X28 @ esk3_0))|~((epred1_0 @ (esk4_2 @ (^[Z0/* 3 */:$i]:(((X27 @ Z0)=(X28 @ Z0)))) @ X4)))|~((epred1_0 @ esk2_0)))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_7])).
2.07/0.75	thf(c_0_12, negated_conjecture, (epred1_0 @ esk2_0), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9])])])).
2.07/0.75	thf(c_0_13, negated_conjecture, ![X5:$i > $o, X4:$i > $o]:(((epred1_0 @ (esk4_2 @ X4 @ (^[Z0/* 7 */:$i]:(~((X5 @ Z0))))))|(X5 @ (esk4_2 @ X4 @ (^[Z0/* 7 */:$i]:(~((X5 @ Z0))))))|~((epred1_0 @ esk2_0))|~((X4 @ esk1_0))|~((X4 @ esk3_0)))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_10])).
2.07/0.75	thf(c_0_14, negated_conjecture, ![X28:$i > $i, X27:$i > $i, X4:$i > $o]:(((X4 @ (esk4_2 @ (^[Z0/* 3 */:$i]:(((X27 @ Z0)=(X28 @ Z0)))) @ X4))|((X27 @ esk1_0)!=(X28 @ esk1_0))|((X27 @ esk3_0)!=(X28 @ esk3_0))|~((epred1_0 @ (esk4_2 @ (^[Z0/* 3 */:$i]:(((X27 @ Z0)=(X28 @ Z0)))) @ X4))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_12])])).
2.07/0.75	thf(c_0_15, negated_conjecture, ![X5:$i > $o, X4:$i > $o]:(((epred1_0 @ (esk4_2 @ X4 @ (^[Z0/* 7 */:$i]:(~((X5 @ Z0))))))|(X5 @ (esk4_2 @ X4 @ (^[Z0/* 7 */:$i]:(~((X5 @ Z0))))))|~((X4 @ esk1_0))|~((X4 @ esk3_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_12])])).
2.07/0.75	thf(c_0_16, negated_conjecture, ![X4:$i > $o]:(((X4 @ (esk4_2 @ (^[Z0/* 3 */:$i]:(($true))) @ X4))|~((epred1_0 @ (esk4_2 @ (^[Z0/* 3 */:$i]:(($true))) @ X4))))), inference(cn,[status(thm)],[inference(er,[status(thm)],[c_0_14])])).
2.07/0.75	thf(c_0_17, negated_conjecture, ![X4:$i > $o]:(((epred1_0 @ (esk4_2 @ X4 @ (^[Z0/* 7 */:$i]:(~((epred1_0 @ Z0))))))|~((X4 @ esk1_0))|~((X4 @ esk3_0)))), inference(ef,[status(thm)],[c_0_15])).
2.07/0.75	thf(c_0_18, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17])])]), ['proof']).
2.07/0.75	# SZS output end CNFRefutation
2.07/0.75	# Parsed axioms                        : 1
2.07/0.75	# Removed by relevancy pruning/SinE    : 0
2.07/0.75	# Initial clauses                      : 16
2.07/0.75	# Removed in clause preprocessing      : 0
2.07/0.75	# Initial clauses in saturation        : 16
2.07/0.75	# Processed clauses                    : 1394
2.07/0.75	# ...of these trivial                  : 65
2.07/0.75	# ...subsumed                          : 459
2.07/0.75	# ...remaining for further processing  : 870
2.07/0.75	# Other redundant clauses eliminated   : 1910
2.07/0.75	# Clauses deleted for lack of memory   : 0
2.07/0.75	# Backward-subsumed                    : 157
2.07/0.75	# Backward-rewritten                   : 428
2.07/0.75	# Generated clauses                    : 6769
2.07/0.75	# ...of the previous two non-redundant : 4290
2.07/0.75	# ...aggressively subsumed             : 0
2.07/0.75	# Contextual simplify-reflections      : 39
2.07/0.75	# Paramodulations                      : 748
2.07/0.75	# Factorizations                       : 18
2.07/0.75	# NegExts                              : 127
2.07/0.75	# Equation resolutions                 : 1947
2.07/0.75	# Total rewrite steps                  : 504
2.07/0.75	# Propositional unsat checks           : 0
2.07/0.75	#    Propositional check models        : 0
2.07/0.75	#    Propositional check unsatisfiable : 0
2.07/0.75	#    Propositional clauses             : 0
2.07/0.75	#    Propositional clauses after purity: 0
2.07/0.75	#    Propositional unsat core size     : 0
2.07/0.75	#    Propositional preprocessing time  : 0.000
2.07/0.75	#    Propositional encoding time       : 0.000
2.07/0.75	#    Propositional solver time         : 0.000
2.07/0.75	#    Success case prop preproc time    : 0.000
2.07/0.75	#    Success case prop encoding time   : 0.000
2.07/0.75	#    Success case prop solver time     : 0.000
2.07/0.75	# Current number of processed clauses  : 169
2.07/0.75	#    Positive orientable unit clauses  : 5
2.07/0.75	#    Positive unorientable unit clauses: 0
2.07/0.75	#    Negative unit clauses             : 1
2.07/0.75	#    Non-unit-clauses                  : 163
2.07/0.75	# Current number of unprocessed clauses: 2678
2.07/0.75	# ...number of literals in the above   : 17779
2.07/0.75	# Current number of archived formulas  : 0
2.07/0.75	# Current number of archived clauses   : 701
2.07/0.75	# Clause-clause subsumption calls (NU) : 39820
2.07/0.75	# Rec. Clause-clause subsumption calls : 2629
2.07/0.75	# Non-unit clause-clause subsumptions  : 651
2.07/0.75	# Unit Clause-clause subsumption calls : 277
2.07/0.75	# Rewrite failures with RHS unbound    : 0
2.07/0.75	# BW rewrite match attempts            : 12
2.07/0.75	# BW rewrite match successes           : 5
2.07/0.75	# Condensation attempts                : 0
2.07/0.75	# Condensation successes               : 0
2.07/0.75	# Termbank termtop insertions          : 368007
2.07/0.75	
2.07/0.75	# -------------------------------------------------
2.07/0.75	# User time                : 0.273 s
2.07/0.75	# System time              : 0.010 s
2.07/0.75	# Total time               : 0.283 s
2.07/0.75	# Maximum resident set size: 1768 pages
2.07/0.75	
2.07/0.75	# -------------------------------------------------
2.07/0.75	# User time                : 0.273 s
2.07/0.75	# System time              : 0.013 s
2.07/0.75	# Total time               : 0.287 s
2.07/0.75	# Maximum resident set size: 1688 pages
2.07/0.75	% E---3.1 exiting
2.07/0.75	EOF